Detecting Hidden Differences via Permutation Symmetries

نویسندگان

  • R. B. A. Adamson
  • P. S. Turner
چکیده

R. B. A. Adamson,1 P. S. Turner,2, 3 M. W. Mitchell,4 and A. M. Steinberg1 1Centre for Quantum Information & Quantum Control and Institute for Optical Sciences, Dept. of Physics, 60 St. George St., University of Toronto, Toronto, ON, Canada, M5S 1A7 2Institute for Quantum Information Science, University of Calgary, 2500 University Drive NW, Calgary, AB, Canada, T2N 1N4 3Current address: Department of Physics, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo, Japan, 113-0033 4ICFO Institut de Ciències Fotòniques, 08860 Castelldefels (Barcelona), Spain (Dated: August 5, 2008)

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Markov Chains on Orbits of Permutation Groups

We present a novel approach to detecting and utilizing symmetries in probabilistic graphical models with two main contributions. First, we present a scalable approach to computing generating sets of permutation groups representing the symmetries of graphical models. Second, we introduce orbital Markov chains, a novel family of Markov chains leveraging model symmetries to reduce mixing times. We...

متن کامل

Calculations of Dihedral Groups Using Circular Indexation

‎In this work‎, ‎a regular polygon with $n$ sides is described by a periodic (circular) sequence with period $n$‎. ‎Each element of the sequence represents a vertex of the polygon‎. ‎Each symmetry of the polygon is the rotation of the polygon around the center-point and/or flipping around a symmetry axis‎. ‎Here each symmetry is considered as a system that takes an input circular sequence and g...

متن کامل

Hidden Symmetries in Simple Graphs

It is shown that each element σ in the normalizer of the automorphism group Aut(G) of a simple graph G with labeled vertex set V is an Aut(G) invariant isomorphism between G and the graph obtained from G by the σ permutation of V—i.e., σ is a hidden permutation symmetry of G. A simple example illustrates the theory and the applied notion of system robustness for reconfiguration under symmetry c...

متن کامل

New Solutions for Fokker-Plank Equation of‎ ‎Special Stochastic Process via Lie Point Symmetries

‎In this paper Lie symmetry analysis is applied in order to find new solutions for Fokker Plank equation of Ornstein-Uhlenbeck process‎. ‎This analysis classifies the solutions format of the Fokker Plank equation by using the Lie algebra of the symmetries of our considered stochastic process‎.

متن کامل

Detecting approximate symmetries of discrete point subsets

Detecting approximate symmetries of parts of a model is important when attempting to determine the geometric design intent of approximate boundary-representation (B-rep) solid models produced e.g. by reverse engineering systems. For example, such detected symmetries may be enforced exactly on the model to improve its shape, to simplify its analysis, or to constrain it during editing. We give an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008